Since the research on testing technology for JavaScript browser compatibility problems is insufficient, based on mutation testing method and the analysis on the compatibility of JavaScript in Web applications in major browsers, eighteen mutation operators was designed, and an automated testing tool named Compatibility Mutator was implemented. Compatibility Mutator analyze JavaScript syntax with Abstract Syntax Tree (AST), calls various browsers with Selenium WebDriver to run mutation testing automatically and concurrently. The experiments on 7 widely-used JavaScript frameworks showed that the proposed mutation operators could generate a certain amount of mutants, the mutation scores got from mutation testing on jQuery and YUI were 43.06% and 7.69% respectively. Experimental results prove that the proposed operators can trigger the compatibility issues effectively, and evaluate the completeness of test suite effectively in finding the browser compatibility issues.

In view of the fact that the existing algorithms cannot effectively be applied to multi-factor trajectory outlier detection, this paper proposed a new method named TOD-KPCA (Trajectory Outlier Detection method based on Kernel Principal Component Analysis). Firstly, in order to enhance the effect of trajectory feature extraction, the method used KPCA to do the space transformation for trajectories and converted nonlinear space to a high dimension linear space. Furthermore, in order to improve the accuracy of outlier detection, the method used one-class Support Vector Machine (SVM) to do unsupervised learning and prediction with trajectory feature data. Finally, the method detected those trajectories with abnormal behavior. The proposed algorithm was tested on the Atlantic hurricane data. The experimental results show that the proposed algorithm can effectively extract trajectory features, and compared with the same algorithm, the proposed algorithm has better detection results in terms of multi-factor trajectory outlier detection.

For current trajectory data generalization methods, the scope of the generalized regions cannot be controlled effectively, and the parameters of the grids can hardly be selected logically. This paper proposed the method of Local Multi-hierarchy Grid (LMG), so that the region with dense trajectory points would be divided iteratively. And then a method for trajectory data generalization named TRAGenLMG was proposed, which was based on LMG, and time-constraint was used to merge some adjoining grids, and finally the generalized trajectory was got. The experiments with real open dataset show that the generalized trajectories generated by TRAGenLMG can well maintain the temporal feature of the trajectory data and can be efficiently applied into further data analysis.

Clustering can be used in the routing algorithm to enhance the scalability of Wireless Sensor Network (WSN). Concerning the defects of traditional clustering algorithm, a new strategy EDC (Energy-efficient, Dual-path, Clustering) was proposed, in which the member node has an optimal backup path. The strategy guaranteed that member node can still transmit data through its backup path when its cluster head was dying in the WSN. The results of the simulation experiment on the platform OMNeT ++ indicate that EDC performs much better than other protocols of WSN in terms of network reconstruction time and number of failed nodes.

Focusing on the random packet loss, the high failure rate of failure detection for network storage system with random packet loss was studied. A Fault Detection (FD) for network storage with random packet dropout was presented. The residual generation and residual evaluation as well as False Alarm Rate （FAR） were used in the approach. First, residual generation was carried out in the periodic system framework. Then, residual evaluation was got by making use of the stochastic properties of the random packet loss. Finally, performance evaluation of the computation of FAR is fulfilled with the assistance of Chebyshev's inequality, and the algorithms of fault detection were given. The simulation results show that this approach can effectively detect the fault. Moreover, this approach is sensitive to fault.

Fast and accurate Point Spread Function (PSF) estimation method is the premise to obtain good results on the blur image restoration. To solve the deficiency of the discrete PSF of defocus-blurred and motion-blurred images, a discretization method was proposed based on the combination of geometric property of degradation model and sub-pixel estimation. Specifically, the principle of weight allocation was defined, which was related to the distance with the neighboring pixels. Thus, the discretization of PSF was realized. Finally, the experimental results illustrate that the proposed method improves result precision and outperforms the traditional one on visual quality, sharpness evaluation function, Peak Signal-to-Noise Ratio (PSNR) and Improved Signal-to-Noise Ratio (ISNR).

In order to improve the poor local search capability and low convergence precision of GA when applied in curvefitting, a new improved GA, named Population Redistributing Genetic Algorithm (PRGA), was proposed. With the progress of GA, this new algorithm adjusted the distribution of the population according to the quality of the best solution, thus effectively improved GAs local search capability. According to the results of the experiments on simulated data, PRGA gives better results in curve fitting compared with simple GA and traditional numerical iterative method.

This thesis took apart the unordered label tree matching into tree structure matching and tree label semantic matching. By combined with the tree structure matching and semantic matching, the thesis changed the traditional tree matching algorithms into approximately matching, and a metadata retrieval method based on three-level tree approximately matching model was put forward. According to this new retrieval method, the accuracy and recall rates would be adjusted by different requirement of users. In the end, this thesis brought forward the retrieval process of XML-oriented metadata, and gave out the applied design of metadata approximately match. The results of experiments prove that the approximately matching model is feasible and efficient in the application of retrieval XML metadata.

XML element-wise encryption is used to encrypt a certain part of XML document. In this paper, auther discussed the technology of element-wise encryption based on XSLT, and introduced a method that extension functions were used to provide function of encryption and decryption with some examples. Compared with other element-wise encryption technologies, the biggest advantage of this one is to avoid deployment and maintenance. All the security operations are confined to stylesheet and not involved in XSLT processor. So this technology has high-usability.

The result that current web search engineer returned were ranked mainly by their hyperlink analyse, not their content. To take the search results as an order collection, we used item frenqency statistic and calculated item position in every page by certain formula, by which we calculated each pages relativity and re-ranked the collection. The experiment results show that the pages which meet the users needs were concentrated ahead. In this way, The precision was enhanced. It can help user find information rapidly.